PageRank of integers

نویسندگان

  • Klaus M. Frahm
  • Alexei Chepelianskii
  • Dima Shepelyansky
چکیده

We build up a directed network tracing links from a given integer to its divisors and analyze the properties of the Google matrix of this network. The PageRank vector of this matrix is computed numerically and it is shown that its probability is inversely proportional to the PageRank index thus being similar to the Zipf law and the dependence established for the World Wide Web. The spectrum of the Google matrix of integers is characterized by a large gap and a relatively small number of nonzero eigenvalues. A simple semi-analytical expression for the PageRank of integers is derived that allows to find this vector for matrices of billion size. This network provides a new PageRank order of integers.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Evaluation of the Team Performance of MLB Applying PageRank Algorithm

Background. There is a weakness that the win-loss ranking model in the MLB now is calculated based on the result of a win-loss game, so we assume that a ranking system considering the opponent’s team performance is necessary. Objectives. This study aims to suggest the PageRank algorithm to complement the problem with ranking calculated with winning ratio in calculating team ranking of US MLB. ...

متن کامل

Application of PageRank Model for Olympic Women’s Taekwondo Rankings: Comparison of PageRank and Accumulated Point Index System

Background. Although the World Taekwondo federation currently applies the APIS ranking method to calculate the Olympic rankings, some limitations exist. Objectives. This study applies the PageRank model to Olympics Taekwondo rankings. Methods. The 2015-2018 World Taekwondo Grand Prix competition results for women’s four weight classes (-49kg, -57kg, -67kg, +67kg) were used as research data, t...

متن کامل

A Novel Approach to Feature Selection Using PageRank algorithm for Web Page Classification

In this paper, a novel filter-based approach is proposed using the PageRank algorithm to select the optimal subset of features as well as to compute their weights for web page classification. To evaluate the proposed approach multiple experiments are performed using accuracy score as the main criterion on four different datasets, namely WebKB, Reuters-R8, Reuters-R52, and 20NewsGroups. By analy...

متن کامل

On a sequence related to the coprime integers

The asymptotic behaviour of the sequence with general term $P_n=(varphi(1)+varphi(2)+cdots+varphi(n))/(1+2+cdots+n)$, is studied which appears in the studying of coprime integers, and an explicit bound for the difference $P_n-6/pi^2$ is found.

متن کامل

EEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations

GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1205.6343  شماره 

صفحات  -

تاریخ انتشار 2012